Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach - VLSI Design, 1996. Proceedings., Ninth International Conference on

نویسندگان

  • C. A. Mandal
  • P. P. Chakrabarti
  • S. Ghose
چکیده

A technique for allocatzon and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach has been developed. The proposed genetic algorithm uses a non-conventional crossover mechanism, relying on a novel force directed data path binding completion algorithm. The proposed technique has a number of features such as acceptance of some design pammeters fnom the user, use of a bus based topology, use of multi-port memories and provision for multi-cycling and pipelining, among other features. The results obtained on the standard examples are promising.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach

We have developed a technique for allocation and binding for data path synthesis using a Genetic Algorithm approach. The use of the genetic algorithm is relatively new in EDA tools. The proposed genetic algorithm uses a non-conventional crossover mechanism, relying on a novel force directed data path binding completion algorithm. The developed system has a number of features such as acceptance ...

متن کامل

Routing Using Implicit Connection Graphs - VLSI Design, 1996. Proceedings., Ninth International Conference on

We introduce a framework for a class of algorithms solving shortest path related problems, such as the one-to-one shortest path problem, the one-to-many shortest paths pmblem and the minimum spanning tree problem, in the presence of obstacles. For these algorithms, the search space is restricted to a sparse strong connection graph which is implicitly represented and its searched portion is cons...

متن کامل

GABIND: a GA approach to allocation and binding for the high-level synthesis of data paths

We present here a technique for allocation and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach. This GA uses an unconventional crossover mechanism relying on a force directed data path binding completion algorithm. The data path is synthesized using some supplied design parameters. A bus-based interconnection scheme, use of multi-port memories, and provision for mu...

متن کامل

Synthesis of Testable Pipelined Datapaths Using Genetic Search

In this paper, we describe TOGAPS, a TestabilityOriented Genetic Algorithm for Pipeline Synthesis. The input to TOGAPS is an unscheduled data flow graph along with a specification of the desired pipeline latency. TOGAPS generates a register-level description of a datapath which is near-optimal in terms of area, meets the latency requirement, and is highly testable. Genetic search is employed to...

متن کامل

Designing a multi-objective nonlinear cross-docking location allocation model using genetic algorithm

In this study, a cross-docking system is designed at strategic and tactical levels. For making the strategic decisions, a multi-objective nonlinear location allocation model for cross-docks is presented based on a distri-bution location allocation model by Andreas Klose and Andreas Drexl. The model is further developed to in-clude the whole supply chain members and the objective functions are w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004